TSTP Solution File: NLP001^7 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : NLP001^7 : TPTP v8.1.2. Released v5.5.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n019.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Thu Aug 31 09:39:21 EDT 2023
% Result : CounterSatisfiable 35.67s 36.02s
% Output : Assurance 0s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----No solution output by system
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.14 % Problem : NLP001^7 : TPTP v8.1.2. Released v5.5.0.
% 0.00/0.15 % Command : do_cvc5 %s %d
% 0.15/0.37 % Computer : n019.cluster.edu
% 0.15/0.37 % Model : x86_64 x86_64
% 0.15/0.37 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.15/0.37 % Memory : 8042.1875MB
% 0.15/0.37 % OS : Linux 3.10.0-693.el7.x86_64
% 0.15/0.37 % CPULimit : 300
% 0.15/0.37 % WCLimit : 300
% 0.15/0.37 % DateTime : Thu Aug 24 10:44:43 EDT 2023
% 0.15/0.37 % CPUTime :
% 0.23/0.52 %----Proving TH0
% 0.23/0.53 %------------------------------------------------------------------------------
% 0.23/0.53 % File : NLP001^7 : TPTP v8.1.2. Released v5.5.0.
% 0.23/0.53 % Domain : Natural Language Processing
% 0.23/0.53 % Problem : "The old dirty white Chevy" problem
% 0.23/0.53 % Version : [Ben12] axioms.
% 0.23/0.53 % English :
% 0.23/0.53
% 0.23/0.53 % Refs : [Bos00] Bos (2000), DORIS: Discourse Oriented Representation an
% 0.23/0.53 % : [Ben12] Benzmueller (2012), Email to Geoff Sutcliffe
% 0.23/0.53 % Source : [Ben12]
% 0.23/0.53 % Names : s4-cumul-NLP001+1 [Ben12]
% 0.23/0.53
% 0.23/0.53 % Status : Theorem
% 0.23/0.53 % Rating : 0.31 v8.1.0, 0.27 v7.5.0, 0.29 v7.4.0, 0.33 v7.2.0, 0.25 v7.1.0, 0.38 v7.0.0, 0.29 v6.4.0, 0.33 v6.3.0, 0.40 v6.2.0, 0.43 v5.5.0
% 0.23/0.53 % Syntax : Number of formulae : 87 ( 33 unt; 50 typ; 32 def)
% 0.23/0.53 % Number of atoms : 234 ( 36 equ; 0 cnn)
% 0.23/0.53 % Maximal formula atoms : 128 ( 6 avg)
% 0.23/0.53 % Number of connectives : 341 ( 5 ~; 5 |; 9 &; 312 @)
% 0.23/0.53 % ( 0 <=>; 10 =>; 0 <=; 0 <~>)
% 0.23/0.53 % Maximal formula depth : 30 ( 2 avg)
% 0.23/0.53 % Number of types : 3 ( 1 usr)
% 0.23/0.53 % Number of type conns : 211 ( 211 >; 0 *; 0 +; 0 <<)
% 0.23/0.53 % Number of symbols : 55 ( 53 usr; 5 con; 0-3 aty)
% 0.23/0.53 % Number of variables : 106 ( 65 ^; 34 !; 7 ?; 106 :)
% 0.23/0.53 % SPC : TH0_THM_EQU_NAR
% 0.23/0.53
% 0.23/0.53 % Comments :
% 0.23/0.53 %------------------------------------------------------------------------------
% 0.23/0.53 %----Include axioms for Modal logic S4 under cumulative domains
% 0.23/0.53 %------------------------------------------------------------------------------
% 0.23/0.53 %----Declaration of additional base type mu
% 0.23/0.53 thf(mu_type,type,
% 0.23/0.53 mu: $tType ).
% 0.23/0.53
% 0.23/0.53 %----Equality
% 0.23/0.53 thf(qmltpeq_type,type,
% 0.23/0.53 qmltpeq: mu > mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 % originale Definition
% 0.23/0.53 %thf(qmltpeq,definition,
% 0.23/0.53 % ( qmltpeq
% 0.23/0.53 % = ( ^ [X: mu,Y: mu,W: $i] : ( X = Y ) ) )).
% 0.23/0.53
% 0.23/0.53 % erweiterte Leibnitz-Definition
% 0.23/0.53 %thf(qmltpeq,definition,
% 0.23/0.53 % ( qmltpeq
% 0.23/0.53 % = ( ^ [X: mu,Y: mu,W: $i] : (![P: mu > $i > $o]: ( (P @ X @ W) <=> (P @ Y @ W) ) ) ) )).
% 0.23/0.53
% 0.23/0.53 % Leibnitz-Definition
% 0.23/0.53 %thf(qmltpeq,definition,
% 0.23/0.53 % ( qmltpeq
% 0.23/0.53 % = ( ^ [X: mu,Y: mu,W: $i] : (! [P: mu > $o]: ( (P @ X) <=> (P @ Y) ) ) ) )).
% 0.23/0.53
% 0.23/0.53 thf(meq_prop_type,type,
% 0.23/0.53 meq_prop: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(meq_prop,definition,
% 0.23/0.53 ( meq_prop
% 0.23/0.53 = ( ^ [X: $i > $o,Y: $i > $o,W: $i] :
% 0.23/0.53 ( ( X @ W )
% 0.23/0.53 = ( Y @ W ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %----Modal operators not, or, box, Pi
% 0.23/0.53 thf(mnot_type,type,
% 0.23/0.53 mnot: ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mnot,definition,
% 0.23/0.53 ( mnot
% 0.23/0.53 = ( ^ [Phi: $i > $o,W: $i] :
% 0.23/0.53 ~ ( Phi @ W ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mor_type,type,
% 0.23/0.53 mor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mor,definition,
% 0.23/0.53 ( mor
% 0.23/0.53 = ( ^ [Phi: $i > $o,Psi: $i > $o,W: $i] :
% 0.23/0.53 ( ( Phi @ W )
% 0.23/0.53 | ( Psi @ W ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mbox_type,type,
% 0.23/0.53 mbox: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mbox,definition,
% 0.23/0.53 ( mbox
% 0.23/0.53 = ( ^ [R: $i > $i > $o,Phi: $i > $o,W: $i] :
% 0.23/0.53 ! [V: $i] :
% 0.23/0.53 ( ~ ( R @ W @ V )
% 0.23/0.53 | ( Phi @ V ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mforall_prop_type,type,
% 0.23/0.53 mforall_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mforall_prop,definition,
% 0.23/0.53 ( mforall_prop
% 0.23/0.53 = ( ^ [Phi: ( $i > $o ) > $i > $o,W: $i] :
% 0.23/0.53 ! [P: $i > $o] : ( Phi @ P @ W ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %----Further modal operators
% 0.23/0.53 thf(mtrue_type,type,
% 0.23/0.53 mtrue: $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mtrue,definition,
% 0.23/0.53 ( mtrue
% 0.23/0.53 = ( ^ [W: $i] : $true ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mfalse_type,type,
% 0.23/0.53 mfalse: $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mfalse,definition,
% 0.23/0.53 ( mfalse
% 0.23/0.53 = ( mnot @ mtrue ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mand_type,type,
% 0.23/0.53 mand: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mand,definition,
% 0.23/0.53 ( mand
% 0.23/0.53 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mor @ ( mnot @ Phi ) @ ( mnot @ Psi ) ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mimplies_type,type,
% 0.23/0.53 mimplies: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mimplies,definition,
% 0.23/0.53 ( mimplies
% 0.23/0.53 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Phi ) @ Psi ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mimplied_type,type,
% 0.23/0.53 mimplied: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mimplied,definition,
% 0.23/0.53 ( mimplied
% 0.23/0.53 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mor @ ( mnot @ Psi ) @ Phi ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mequiv_type,type,
% 0.23/0.53 mequiv: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mequiv,definition,
% 0.23/0.53 ( mequiv
% 0.23/0.53 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mand @ ( mimplies @ Phi @ Psi ) @ ( mimplies @ Psi @ Phi ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mxor_type,type,
% 0.23/0.53 mxor: ( $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mxor,definition,
% 0.23/0.53 ( mxor
% 0.23/0.53 = ( ^ [Phi: $i > $o,Psi: $i > $o] : ( mnot @ ( mequiv @ Phi @ Psi ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mdia_type,type,
% 0.23/0.53 mdia: ( $i > $i > $o ) > ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mdia,definition,
% 0.23/0.53 ( mdia
% 0.23/0.53 = ( ^ [R: $i > $i > $o,Phi: $i > $o] : ( mnot @ ( mbox @ R @ ( mnot @ Phi ) ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %--- (new for cumulative)
% 0.23/0.53 %---Declaration of existence predicate for simulating cumulative domain
% 0.23/0.53 thf(exists_in_world_type,type,
% 0.23/0.53 exists_in_world: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 %----The domains are non-empty
% 0.23/0.53 thf(nonempty_ax,axiom,
% 0.23/0.53 ! [V: $i] :
% 0.23/0.53 ? [X: mu] : ( exists_in_world @ X @ V ) ).
% 0.23/0.53
% 0.23/0.53 thf(mforall_ind_type,type,
% 0.23/0.53 mforall_ind: ( mu > $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 %--- (new for cumulative)
% 0.23/0.53 thf(mforall_ind,definition,
% 0.23/0.53 ( mforall_ind
% 0.23/0.53 = ( ^ [Phi: mu > $i > $o,W: $i] :
% 0.23/0.53 ! [X: mu] :
% 0.23/0.53 ( ( exists_in_world @ X @ W )
% 0.23/0.53 => ( Phi @ X @ W ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %thf(mforall_ind,definition,
% 0.23/0.53 % ( mforall_ind
% 0.23/0.53 % = ( ^ [Phi: mu > $i > $o,W: $i] :
% 0.23/0.53 % ! [X: mu] :
% 0.23/0.53 % ( Phi @ X @ W ) ) )).
% 0.23/0.53
% 0.23/0.53 thf(mexists_ind_type,type,
% 0.23/0.53 mexists_ind: ( mu > $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mexists_ind,definition,
% 0.23/0.53 ( mexists_ind
% 0.23/0.53 = ( ^ [Phi: mu > $i > $o] :
% 0.23/0.53 ( mnot
% 0.23/0.53 @ ( mforall_ind
% 0.23/0.53 @ ^ [X: mu] : ( mnot @ ( Phi @ X ) ) ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mexists_prop_type,type,
% 0.23/0.53 mexists_prop: ( ( $i > $o ) > $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mexists_prop,definition,
% 0.23/0.53 ( mexists_prop
% 0.23/0.53 = ( ^ [Phi: ( $i > $o ) > $i > $o] :
% 0.23/0.53 ( mnot
% 0.23/0.53 @ ( mforall_prop
% 0.23/0.53 @ ^ [P: $i > $o] : ( mnot @ ( Phi @ P ) ) ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %----Definition of properties of accessibility relations
% 0.23/0.53 thf(mreflexive_type,type,
% 0.23/0.53 mreflexive: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mreflexive,definition,
% 0.23/0.53 ( mreflexive
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i] : ( R @ S @ S ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(msymmetric_type,type,
% 0.23/0.53 msymmetric: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(msymmetric,definition,
% 0.23/0.53 ( msymmetric
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i,T: $i] :
% 0.23/0.53 ( ( R @ S @ T )
% 0.23/0.53 => ( R @ T @ S ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mserial_type,type,
% 0.23/0.53 mserial: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mserial,definition,
% 0.23/0.53 ( mserial
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i] :
% 0.23/0.53 ? [T: $i] : ( R @ S @ T ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mtransitive_type,type,
% 0.23/0.53 mtransitive: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mtransitive,definition,
% 0.23/0.53 ( mtransitive
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i,T: $i,U: $i] :
% 0.23/0.53 ( ( ( R @ S @ T )
% 0.23/0.53 & ( R @ T @ U ) )
% 0.23/0.53 => ( R @ S @ U ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(meuclidean_type,type,
% 0.23/0.53 meuclidean: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(meuclidean,definition,
% 0.23/0.53 ( meuclidean
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i,T: $i,U: $i] :
% 0.23/0.53 ( ( ( R @ S @ T )
% 0.23/0.53 & ( R @ S @ U ) )
% 0.23/0.53 => ( R @ T @ U ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mpartially_functional_type,type,
% 0.23/0.53 mpartially_functional: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mpartially_functional,definition,
% 0.23/0.53 ( mpartially_functional
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i,T: $i,U: $i] :
% 0.23/0.53 ( ( ( R @ S @ T )
% 0.23/0.53 & ( R @ S @ U ) )
% 0.23/0.53 => ( T = U ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mfunctional_type,type,
% 0.23/0.53 mfunctional: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mfunctional,definition,
% 0.23/0.53 ( mfunctional
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i] :
% 0.23/0.53 ? [T: $i] :
% 0.23/0.53 ( ( R @ S @ T )
% 0.23/0.53 & ! [U: $i] :
% 0.23/0.53 ( ( R @ S @ U )
% 0.23/0.53 => ( T = U ) ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mweakly_dense_type,type,
% 0.23/0.53 mweakly_dense: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mweakly_dense,definition,
% 0.23/0.53 ( mweakly_dense
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i,T: $i,U: $i] :
% 0.23/0.53 ( ( R @ S @ T )
% 0.23/0.53 => ? [U: $i] :
% 0.23/0.53 ( ( R @ S @ U )
% 0.23/0.53 & ( R @ U @ T ) ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mweakly_connected_type,type,
% 0.23/0.53 mweakly_connected: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mweakly_connected,definition,
% 0.23/0.53 ( mweakly_connected
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i,T: $i,U: $i] :
% 0.23/0.53 ( ( ( R @ S @ T )
% 0.23/0.53 & ( R @ S @ U ) )
% 0.23/0.53 => ( ( R @ T @ U )
% 0.23/0.53 | ( T = U )
% 0.23/0.53 | ( R @ U @ T ) ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mweakly_directed_type,type,
% 0.23/0.53 mweakly_directed: ( $i > $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mweakly_directed,definition,
% 0.23/0.53 ( mweakly_directed
% 0.23/0.53 = ( ^ [R: $i > $i > $o] :
% 0.23/0.53 ! [S: $i,T: $i,U: $i] :
% 0.23/0.53 ( ( ( R @ S @ T )
% 0.23/0.53 & ( R @ S @ U ) )
% 0.23/0.53 => ? [V: $i] :
% 0.23/0.53 ( ( R @ T @ V )
% 0.23/0.53 & ( R @ U @ V ) ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %----Definition of validity
% 0.23/0.53 thf(mvalid_type,type,
% 0.23/0.53 mvalid: ( $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mvalid,definition,
% 0.23/0.53 ( mvalid
% 0.23/0.53 = ( ^ [Phi: $i > $o] :
% 0.23/0.53 ! [W: $i] : ( Phi @ W ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %----Definition of satisfiability
% 0.23/0.53 thf(msatisfiable_type,type,
% 0.23/0.53 msatisfiable: ( $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(msatisfiable,definition,
% 0.23/0.53 ( msatisfiable
% 0.23/0.53 = ( ^ [Phi: $i > $o] :
% 0.23/0.53 ? [W: $i] : ( Phi @ W ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %----Definition of countersatisfiability
% 0.23/0.53 thf(mcountersatisfiable_type,type,
% 0.23/0.53 mcountersatisfiable: ( $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mcountersatisfiable,definition,
% 0.23/0.53 ( mcountersatisfiable
% 0.23/0.53 = ( ^ [Phi: $i > $o] :
% 0.23/0.53 ? [W: $i] :
% 0.23/0.53 ~ ( Phi @ W ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %----Definition of invalidity
% 0.23/0.53 thf(minvalid_type,type,
% 0.23/0.53 minvalid: ( $i > $o ) > $o ).
% 0.23/0.53
% 0.23/0.53 thf(minvalid,definition,
% 0.23/0.53 ( minvalid
% 0.23/0.53 = ( ^ [Phi: $i > $o] :
% 0.23/0.53 ! [W: $i] :
% 0.23/0.53 ~ ( Phi @ W ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %------------------------------------------------------------------------------
% 0.23/0.53 %------------------------------------------------------------------------------
% 0.23/0.53 %----We reserve an accessibility relation constant rel_s4
% 0.23/0.53 thf(rel_s4_type,type,
% 0.23/0.53 rel_s4: $i > $i > $o ).
% 0.23/0.53
% 0.23/0.53 %----We define mbox_s4 and mdia_s4 based on rel_s4
% 0.23/0.53 thf(mbox_s4_type,type,
% 0.23/0.53 mbox_s4: ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mbox_s4,definition,
% 0.23/0.53 ( mbox_s4
% 0.23/0.53 = ( ^ [Phi: $i > $o,W: $i] :
% 0.23/0.53 ! [V: $i] :
% 0.23/0.53 ( ~ ( rel_s4 @ W @ V )
% 0.23/0.53 | ( Phi @ V ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 thf(mdia_s4_type,type,
% 0.23/0.53 mdia_s4: ( $i > $o ) > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(mdia_s4,definition,
% 0.23/0.53 ( mdia_s4
% 0.23/0.53 = ( ^ [Phi: $i > $o] : ( mnot @ ( mbox_s4 @ ( mnot @ Phi ) ) ) ) ) ).
% 0.23/0.53
% 0.23/0.53 %----We have now two options for stating the B conditions:
% 0.23/0.53 %----We can (i) directly formulate conditions for the accessibility relation
% 0.23/0.53 %----constant or we can (ii) state corresponding axioms. We here prefer (i)
% 0.23/0.53 thf(a1,axiom,
% 0.23/0.53 mreflexive @ rel_s4 ).
% 0.23/0.53
% 0.23/0.53 thf(a2,axiom,
% 0.23/0.53 mtransitive @ rel_s4 ).
% 0.23/0.53
% 0.23/0.53 %------------------------------------------------------------------------------
% 0.23/0.53 %------------------------------------------------------------------------------
% 0.23/0.53 thf(cumulative_ax,axiom,
% 0.23/0.53 ! [X: mu,V: $i,W: $i] :
% 0.23/0.53 ( ( ( exists_in_world @ X @ V )
% 0.23/0.53 & ( rel_s4 @ V @ W ) )
% 0.23/0.53 => ( exists_in_world @ X @ W ) ) ).
% 0.23/0.53
% 0.23/0.53 %------------------------------------------------------------------------------
% 0.23/0.53 %------------------------------------------------------------------------------
% 0.23/0.53 thf(in_type,type,
% 0.23/0.53 in: mu > mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(down_type,type,
% 0.23/0.53 down: mu > mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(barrel_type,type,
% 0.23/0.53 barrel: mu > mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(old_type,type,
% 0.23/0.53 old: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(dirty_type,type,
% 0.23/0.53 dirty: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(white_type,type,
% 0.23/0.53 white: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(car_type,type,
% 0.23/0.53 car: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(chevy_type,type,
% 0.23/0.53 chevy: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(lonely_type,type,
% 0.23/0.53 lonely: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(way_type,type,
% 0.23/0.53 way: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(street_type,type,
% 0.23/0.53 street: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(event_type,type,
% 0.23/0.53 event: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(city_type,type,
% 0.23/0.53 city: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(hollywood_type,type,
% 0.23/0.53 hollywood: mu > $i > $o ).
% 0.23/0.53
% 0.23/0.53 thf(co1,conjecture,
% 0.23/0.53 ( mvalid
% 0.23/0.53 @ ( mand
% 0.23/0.53 @ ( mimplies
% 0.23/0.53 @ ( mexists_ind
% 0.23/0.53 @ ^ [U: mu] :
% 0.23/0.53 ( mexists_ind
% 0.23/0.53 @ ^ [V: mu] :
% 0.23/0.53 ( mexists_ind
% 0.23/0.53 @ ^ [W: mu] :
% 0.23/0.53 ( mexists_ind
% 0.23/0.53 @ ^ [X: mu] : ( mand @ ( hollywood @ U ) @ ( mand @ ( city @ U ) @ ( mand @ ( event @ V ) @ ( mand @ ( street @ W ) @ ( mand @ ( way @ W ) @ ( mand @ ( lonely @ W ) @ ( mand @ ( chevy @ X ) @ ( mand @ ( car @ X ) @ ( mand @ ( white @ X ) @ ( mand @ ( dirty @ X ) @ ( mand @ ( old @ X ) @ ( mand @ ( barrel @ V @ X ) @ ( mand @ ( down @ V @ W ) @ ( in @ V @ U ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )
% 0.23/0.54 @ ( mexists_ind
% 0.23/0.54 @ ^ [Y: mu] :
% 0.23/0.54 ( mexists_ind
% 0.23/0.54 @ ^ [Z: mu] :
% 0.23/0.54 ( mexists_ind
% 0.23/0.54 @ ^ [X1: mu] :
% 0.23/0.54 ( mexists_ind
% 0.23/0.54 @ ^ [X2: mu] : ( mand @ ( hollywood @ Y ) @ ( mand @ ( city @ Y ) @ ( mand @ ( event @ Z ) @ ( mand @ ( chevy @ X1 ) @ ( mand @ ( car @ X1 ) @ ( mand @ ( white @ X1 ) @ ( mand @ ( dirty @ X1 ) @ ( mand @ ( old @ X1 ) @ ( mand @ ( street @ X2 ) @ ( mand @ ( way @ X2 ) @ ( mand @ ( lonely @ X2 ) @ ( mand @ ( barrel @ Z @ X1 ) @ ( mand @ ( down @ Z @ X2 ) @ ( in @ Z @ Y ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )
% 0.23/0.54 @ ( mimplies
% 0.23/0.54 @ ( mexists_ind
% 0.23/0.54 @ ^ [X3: mu] :
% 0.23/0.54 ( mexists_ind
% 0.23/0.54 @ ^ [X4: mu] :
% 0.23/0.54 ( mexists_ind
% 0.23/0.54 @ ^ [X5: mu] :
% 0.23/0.54 ( mexists_ind
% 0.23/0.54 @ ^ [X6: mu] : ( mand @ ( hollywood @ X3 ) @ ( mand @ ( city @ X3 ) @ ( mand @ ( event @ X4 ) @ ( mand @ ( chevy @ X5 ) @ ( mand @ ( car @ X5 ) @ ( mand @ ( white @ X5 ) @ ( mand @ ( dirty @ X5 ) @ ( mand @ ( old @ X5 ) @ ( mand @ ( street @ X6 ) @ ( mand @ ( way @ X6 ) @ ( mand @ ( lonely @ X6 ) @ ( mand @ ( barrel @ X4 @ X5 ) @ ( mand @ ( down @ X4 @ X6 ) @ ( in @ X4 @ X3 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) )
% 0.23/0.54 @ ( mexists_ind
% 0.23/0.54 @ ^ [X7: mu] :
% 0.23/0.54 ( mexists_ind
% 0.23/0.54 @ ^ [X8: mu] :
% 0.23/0.54 ( mexists_ind
% 0.23/0.54 @ ^ [X9: mu] :
% 0.23/0.54 ( mexists_ind
% 0.23/0.54 @ ^ [X10: mu] : ( mand @ ( hollywood @ X7 ) @ ( mand @ ( city @ X7 ) @ ( mand @ ( event @ X8 ) @ ( mand @ ( street @ X9 ) @ ( mand @ ( way @ X9 ) @ ( mand @ ( lonely @ X9 ) @ ( mand @ ( chevy @ X10 ) @ ( mand @ ( car @ X10 ) @ ( mand @ ( white @ X10 ) @ ( mand @ ( dirty @ X10 ) @ ( mand @ ( old @ X10 ) @ ( mand @ ( barrel @ X8 @ X10 ) @ ( mand @ ( down @ X8 @ X9 ) @ ( in @ X8 @ X7 ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ) ).
% 0.23/0.54
% 0.23/0.54 %------------------------------------------------------------------------------
% 0.23/0.54 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.ROJzqpZikw/cvc5---1.0.5_15783.p...
% 0.23/0.54 (declare-sort $$unsorted 0)
% 0.23/0.54 (declare-sort tptp.mu 0)
% 0.23/0.54 (declare-fun tptp.qmltpeq (tptp.mu tptp.mu $$unsorted) Bool)
% 0.23/0.54 (declare-fun tptp.meq_prop ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.54 (assert (= tptp.meq_prop (lambda ((X (-> $$unsorted Bool)) (Y (-> $$unsorted Bool)) (W $$unsorted)) (= (@ X W) (@ Y W)))))
% 0.23/0.54 (declare-fun tptp.mnot ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.54 (assert (= tptp.mnot (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (not (@ Phi W)))))
% 0.23/0.54 (declare-fun tptp.mor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.54 (assert (= tptp.mor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (W $$unsorted)) (or (@ Phi W) (@ Psi W)))))
% 0.23/0.54 (declare-fun tptp.mbox ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mbox (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ R W) V)) (@ Phi V))))))
% 0.23/0.55 (declare-fun tptp.mforall_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mforall_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (W $$unsorted)) (forall ((P (-> $$unsorted Bool))) (@ (@ Phi P) W)))))
% 0.23/0.55 (declare-fun tptp.mtrue ($$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mtrue (lambda ((W $$unsorted)) true)))
% 0.23/0.55 (declare-fun tptp.mfalse ($$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mfalse (@ tptp.mnot tptp.mtrue)))
% 0.23/0.55 (declare-fun tptp.mand ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mand (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mor (@ tptp.mnot Phi)) (@ tptp.mnot Psi))) __flatten_var_0))))
% 0.23/0.55 (declare-fun tptp.mimplies ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mimplies (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Phi)) Psi) __flatten_var_0))))
% 0.23/0.55 (declare-fun tptp.mimplied ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mimplied (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mor (@ tptp.mnot Psi)) Phi) __flatten_var_0))))
% 0.23/0.55 (declare-fun tptp.mequiv ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mequiv (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ (@ tptp.mimplies Phi) Psi)) (@ (@ tptp.mimplies Psi) Phi)) __flatten_var_0))))
% 0.23/0.55 (declare-fun tptp.mxor ((-> $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mxor (lambda ((Phi (-> $$unsorted Bool)) (Psi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mequiv Phi) Psi)) __flatten_var_0))))
% 0.23/0.55 (declare-fun tptp.mdia ((-> $$unsorted $$unsorted Bool) (-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mdia (lambda ((R (-> $$unsorted $$unsorted Bool)) (Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ (@ tptp.mbox R) (@ tptp.mnot Phi))) __flatten_var_0))))
% 0.23/0.55 (declare-fun tptp.exists_in_world (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (assert (forall ((V $$unsorted)) (exists ((X tptp.mu)) (@ (@ tptp.exists_in_world X) V))))
% 0.23/0.55 (declare-fun tptp.mforall_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mforall_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (W $$unsorted)) (forall ((X tptp.mu)) (=> (@ (@ tptp.exists_in_world X) W) (@ (@ Phi X) W))))))
% 0.23/0.55 (declare-fun tptp.mexists_ind ((-> tptp.mu $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mexists_ind (lambda ((Phi (-> tptp.mu $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi X)) __flatten_var_0)))) __flatten_var_0))))
% 0.23/0.55 (declare-fun tptp.mexists_prop ((-> (-> $$unsorted Bool) $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mexists_prop (lambda ((Phi (-> (-> $$unsorted Bool) $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mforall_prop (lambda ((P (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ Phi P)) __flatten_var_0)))) __flatten_var_0))))
% 0.23/0.55 (declare-fun tptp.mreflexive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mreflexive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (@ (@ R S) S)))))
% 0.23/0.55 (declare-fun tptp.msymmetric ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.msymmetric (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted)) (=> (@ (@ R S) T) (@ (@ R T) S))))))
% 0.23/0.55 (declare-fun tptp.mserial ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mserial (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (@ (@ R S) T))))))
% 0.23/0.55 (declare-fun tptp.mtransitive ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mtransitive (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ (@ R T) U)) (@ _let_1 U)))))))
% 0.23/0.55 (declare-fun tptp.meuclidean ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.meuclidean (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (@ (@ R T) U)))))))
% 0.23/0.55 (declare-fun tptp.mpartially_functional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mpartially_functional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (= T U)))))))
% 0.23/0.55 (declare-fun tptp.mfunctional ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mfunctional (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted)) (exists ((T $$unsorted)) (and (@ (@ R S) T) (forall ((U $$unsorted)) (=> (@ (@ R S) U) (= T U)))))))))
% 0.23/0.55 (declare-fun tptp.mweakly_dense ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mweakly_dense (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (=> (@ (@ R S) T) (exists ((U $$unsorted)) (and (@ (@ R S) U) (@ (@ R U) T))))))))
% 0.23/0.55 (declare-fun tptp.mweakly_connected ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mweakly_connected (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (or (@ (@ R T) U) (= T U) (@ (@ R U) T))))))))
% 0.23/0.55 (declare-fun tptp.mweakly_directed ((-> $$unsorted $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mweakly_directed (lambda ((R (-> $$unsorted $$unsorted Bool))) (forall ((S $$unsorted) (T $$unsorted) (U $$unsorted)) (let ((_let_1 (@ R S))) (=> (and (@ _let_1 T) (@ _let_1 U)) (exists ((V $$unsorted)) (and (@ (@ R T) V) (@ (@ R U) V)))))))))
% 0.23/0.55 (declare-fun tptp.mvalid ((-> $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (@ Phi W)))))
% 0.23/0.55 (declare-fun tptp.msatisfiable ((-> $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.msatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (@ Phi W)))))
% 0.23/0.55 (declare-fun tptp.mcountersatisfiable ((-> $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.mcountersatisfiable (lambda ((Phi (-> $$unsorted Bool))) (exists ((W $$unsorted)) (not (@ Phi W))))))
% 0.23/0.55 (declare-fun tptp.minvalid ((-> $$unsorted Bool)) Bool)
% 0.23/0.55 (assert (= tptp.minvalid (lambda ((Phi (-> $$unsorted Bool))) (forall ((W $$unsorted)) (not (@ Phi W))))))
% 0.23/0.55 (declare-fun tptp.rel_s4 ($$unsorted $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.mbox_s4 ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mbox_s4 (lambda ((Phi (-> $$unsorted Bool)) (W $$unsorted)) (forall ((V $$unsorted)) (or (not (@ (@ tptp.rel_s4 W) V)) (@ Phi V))))))
% 0.23/0.55 (declare-fun tptp.mdia_s4 ((-> $$unsorted Bool) $$unsorted) Bool)
% 0.23/0.55 (assert (= tptp.mdia_s4 (lambda ((Phi (-> $$unsorted Bool)) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mnot (@ tptp.mbox_s4 (@ tptp.mnot Phi))) __flatten_var_0))))
% 0.23/0.55 (assert (@ tptp.mreflexive tptp.rel_s4))
% 0.23/0.55 (assert (@ tptp.mtransitive tptp.rel_s4))
% 0.23/0.55 (assert (forall ((X tptp.mu) (V $$unsorted) (W $$unsorted)) (let ((_let_1 (@ tptp.exists_in_world X))) (=> (and (@ _let_1 V) (@ (@ tptp.rel_s4 V) W)) (@ _let_1 W)))))
% 0.23/0.55 (declare-fun tptp.in (tptp.mu tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.down (tptp.mu tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.barrel (tptp.mu tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.old (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.dirty (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.white (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.car (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.chevy (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.lonely (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.way (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.street (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.event (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.city (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (declare-fun tptp.hollywood (tptp.mu $$unsorted) Bool)
% 0.23/0.55 (assert (not (@ tptp.mvalid (@ (@ tptp.mand (@ (@ tptp.mimplies (@ tptp.mexists_ind (lambda ((U tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((V tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((W tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((X tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ tptp.hollywood U)) (@ (@ tptp.mand (@ tptp.city U)) (@ (@ tptp.mand (@ tptp.event V)) (@ (@ tptp.mand (@ tptp.street W)) (@ (@ tptp.mand (@ tptp.way W)) (@ (@ tptp.mand (@ tptp.lonely W)) (@ (@ tptp.mand (@ tptp.chevy X)) (@ (@ tptp.mand (@ tptp.car X)) (@ (@ tptp.mand (@ tptp.white X)) (@ (@ tptp.mand (@ tptp.dirty X)) (@ (@ tptp.mand (@ tptp.old X)) (@ (@ tptp.mand (@ (@ tptp.barrel V) X)) (@ (@ tptp.mand (@ (@ tptp.down V) W)) (@ (@ tptp.in V) U)))))))))))))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0)))) (@ tptp.mexists_ind (lambda ((Y tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((Z tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((X1 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((X2 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ tptp.hollywood Y)) (@ (@ tptp.mand (@ tptp.city Y)) (@ (@ tptp.mand (@ tptp.event Z)) (@ (@ tptp.mand (@ tptp.chevy X1)) (@ (@ tptp.mand (@ tptp.car X1)) (@ (@ tptp.mand (@ tptp.white X1)) (@ (@ tptp.mand (@ tptp.dirty X1)) (@ (@ tptp.mand (@ tptp.old X1)) (@ (@ tptp.mand (@ tptp.street X2)) (@ (@ tptp.mand (@ tptp.way X2)) (@ (@ tptp.mand (@ tptp.lonely X2)) (@ (@ tptp.mand (@ (@ tptp.barrel Z) X1)) (@ (@ tptp.mand (@ (@ tptp.down Z) X2)) (@ (@ tptp.in Z) Y)))))))))))))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))))) (@ (@ tptp.mimplies (@ tptp.mexists_ind (lambda ((X3 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((X4 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((X5 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((X6 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ tptp.hollywood X3)) (@ (@ tptp.mand (@ tptp.city X3)) (@ (@ tptp.mand (@ tptp.event X4)) (@ (@ tptp.mand (@ tptp.chevy X5)) (@ (@ tptp.mand (@ tptp.car X5)) (@ (@ tptp.mand (@ tptp.white X5)) (@ (@ tptp.mand (@ tptp.dirty X5)) (@ (@ tptp.mand (@ tptp.old X5)) (@ (@ tptp.mand (@ tptp.street X6)) (@ (@ tptp.mand (@ tptp.way X6)) (@ (@ tptp.mand (@ tptp.lonely X6)) (@ (@ tptp.mand (@ (@ tptp.barrel X4) X5)) (@ (@ tptp.mand (@ (@ tptp.down X4) X6)) (@ (@ tptp.in X4) X3)))))))))))))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0)))) (@ tptp.mexists_ind (lambda ((X7 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((X8 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((X9 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ tptp.mexists_ind (lambda ((X10 tptp.mu) (__flatten_var_0 $$unsorted)) (@ (@ (@ tptp.mand (@ tptp.hollywood X7)) (@ (@ tptp.mand (@ tptp.city X7)) (@ (@ tptp.mand (@ tptp.event X8)) (@ (@ tptp.mand (@ tptp.street X9)) (@ (@ tptp.mand (@ tptp.way X9)) (@ (@ tptp.mand (@ tptp.lonely X9)) (@ (@ tptp.mand (@ tptp.chevy X10)) (@ (@ tptp.mand (@ tptp.car X10)) (@ (@ tptp.mand (@ tptp.white X10)) (@ (@ tptp.mand (@ tptp.dirty X10)) (@ (@ tptp.mand (@ tptp.old X10)) (@ (@ tptp.mand (@ (@ tptp.barrel X8) X10)) (@ (@ tptp.mand (@ (@ tptp.down X8) X9)) (@ (@ tptp.in X8) X7)))))))))))))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))) __flatten_var_0))))))))
% 35.67/36.02 (set-info :filename cvc5---1.0.5_15783)
% 35.67/36.02 (check-sat-assuming ( true ))
% 35.67/36.02 ------- get file name : TPTP file name is NLP001^7
% 35.67/36.02 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_15783.smt2...
% 35.67/36.02 --- Run --ho-elim --full-saturate-quant at 10...
% 35.67/36.02 --- Run --ho-elim --no-e-matching --full-saturate-quant at 10...
% 35.67/36.02 --- Run --ho-elim --no-e-matching --enum-inst-sum --full-saturate-quant at 10...
% 35.67/36.02 --- Run --ho-elim --finite-model-find --uf-ss=no-minimal at 5...
% 35.67/36.02 --- Run --no-ho-matching --finite-model-find --uf-ss=no-minimal at 5...
% 35.67/36.02 % SZS status CounterSatisfiable for NLP001^7
% 35.67/36.02 % cvc5---1.0.5 exiting
% 35.67/36.02 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------